Hereditary properties of partitions, ordered graphs and ordered hypergraphs
نویسندگان
چکیده
منابع مشابه
Hereditary properties of partitions, ordered graphs and ordered hypergraphs
In this paper we use the Klazar-Marcus-Tardosmethod (see [22]) to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation π, P contains the partition of [2k] with parts {{i, π(i) + k} : i ∈ [k]}. We also prove a similar jump, from exponential to factorial, in the possible speeds of monotone properties of ordered graphs, and of hereditary pro...
متن کاملOn partitions of hereditary properties of graphs
In this paper a concept Q-Ramsey Class of graphs is introduced, where Q is a class of bipartite graphs. It is a generalization of wellknown concept of Ramsey Class of graphs. Some Q-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that T 2, the class of all outerplanar graphs, is not D1-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds...
متن کاملBasic notions and properties of ordered semihyperrings
In this paper, we introduce the concept of semihyperring $(R,+,cdot)$ together with a suitable partial order $le$. Moreover, we introduce and study hyperideals in ordered semihyperrings. Simple ordered semihyperrings are defined and its characterizations are obtained. Finally, we study some properties of quasi-simple and $B$-simple ordered semihyperrings.
متن کاملFragmentation of ordered partitions and intervals
Fragmentation processes of exchangeable partitions have already been studied by several authors. This paper deals with fragmentations of exchangeable compositions, i.e. partitions of N in which the order of the blocks matters. We will prove that such a fragmentation is bijectively associated to an interval fragmentation. Using this correspondence, we then study two examples : Ruelle’s interval ...
متن کاملHereditary properties of hypergraphs
A hereditary property P is a class of k-graphs closed under isomorphism and taking induced sub-hypergraphs. Let P (k) n denote those k-graphs of P (k) on vertex set {1, . . . , n}. We prove an asymptotic formula for log2 |P (k) n | in terms of a Turán-type function concerning forbidden induced sub-hypergraphs. This result complements several existing theorems for hereditary and monotone graph a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2006
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2006.05.004